A point on fixpoints in posets

نویسنده

  • Frédéric Blanqui
چکیده

Let (X,≤) be a non-empty strictly inductive poset, that is, a non-empty partially ordered set such that every non-empty chain Y has a least upper bound lub(Y ) ∈ X , a chain being a subset of X totally ordered by ≤. We are interested in sufficient conditions such that, given an element a0 ∈ X and a function f : X → X , there is some ordinal k such that ak+1 = ak, where ak is the transfinite sequence of iterates of f starting from a0 (implying that ak is a fixpoint of f):

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results on $L$-complete lattices

The paper deals with special types of $L$-ordered sets, $L$-fuzzy complete lattices, and fuzzy directed complete posets.First, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $L$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $L$-fuzzy complete lattice $(P;e)$, then the least fixpoint of $f$ is meet of a spe...

متن کامل

Fixpoints and Iterated Updates in Abstract Argumentation

Fixpoints play a key role in the mathematical set up of abstract argumentation theory but, we argue, have been relatively underexamined in the literature. The paper studies the logical structure underlying the computation via approximation sequences of the sort of fixpoints relevant in argumentation. Concretely, it presents a number of novel results on the fixed point theory underpinning the ma...

متن کامل

Fixpoints and Bounded Fixpoints for Complex Objects

We investigate a query language for complex-object databases, which is designed to (1) express only tractable queries, and (2) be as expressive over flat relations as first order logic with fixpoints. The language is obtained by extending the nested relational algebra NRA with a "bounded fixpoint" operator. As in the flat case, all PTime computable queries over ordered databases are expressible...

متن کامل

A Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order

Least fixpoints of monotone functions are an important concept in computer science which can be generalised to inflationary fixpoints of arbitrary functions. This raises questions after the expressive power of these two concepts, in particular whether the latter can be expressed as the former in certain circumstances. We show that the inflationary fixpoint of an arbitrary function on a lattice ...

متن کامل

CONDITIONAL EXPECTATION IN THE KOPKA'S D-POSETS

The notion of a $D$-poset was introduced in a connection withquantum mechanical models. In this paper, we introduce theconditional expectation of  random variables on theK^{o}pka's $D$-Poset and prove the basic properties ofconditional expectation on this  structure.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1502.06021  شماره 

صفحات  -

تاریخ انتشار 2014